Multidigit Modular Multiplication with the Explicit Chinese Remainder Theorem
نویسندگان
چکیده
منابع مشابه
An SPA-Based Extension of Schindler's Timing Attack against RSA Using CRT
At CHES 2000, Schindler introduced a timing attack that enables the factorization of an RSA-modulus if RSA implementations use the Chinese Remainder Theorem and Montgomery multiplication. In this paper we introduce another approach for deriving the secret prime factor by focusing on the conditional branch Schindler used in his attack. One of the countermeasures against Schindler’s attack is the...
متن کاملA Timing Attack against RSA with the Chinese Remainder Theorem
We introduce a new type of timing attack which enables the factorization of an RSA-modulus if the exponentiation with the secret exponent uses the Chinese Remainder Theorem and Montgomery’s algorithm. Its standard variant assumes that both exponentiations are carried out with a simple square and multiply algorithm. However, although its efficiency decreases, our attack can also be adapted to mo...
متن کاملObtaining more Karatsuba-like formulae over the binary field
The aim of this paper is to find more Karatsuba-like formulae for a fixed set of moduli polynomials in GF (2)[x]. To this end, a theoretical framework is established. We first generalize the division algorithm, and then present a generalized definition of the remainder of integer division. Finally, a previously generalized Chinese remainder theorem is used to achieve our initial goal. As a by-p...
متن کاملVLSI Design of RSA Cryptosystem Based on the Chinese Remainder Theorem
This paper presents the design and implementation of a systolic RSA cryptosystem based on a modified Montgomery’s algorithm and the Chinese Remainder Theorem (CRT) technique. The CRT technique improves the throughput rate up to 4 times in the best case. The processing unit of the systolic array has 100% utilization because of the proposed block interleaving technique for multiplication and squa...
متن کاملA New Fast Modular Multiplication Method and Its Application to Modular Exponentiation-Based Cryptography
In order to apply exponentiation-based cryptography, such as RSA cryptography and El Gamal cryptography, to a wide range of practical problems, it is desired to devise faster ciphering and deciphering processes. This paper proposes a new algorithm for improving the speed of the exponentiation-based computation. The proposed method is based on the idea in the exponentiation computation that the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995